Queue Lengths and Waiting Times for Multiserver Queues with Abandonment and Retrials
نویسندگان
چکیده
We consider a Markovian multiserver queueing model with time dependent parameters where waiting customers may abandon and subsequently retry. We provide simple uid and di usion approximations to estimate the mean, variance, and density for both the queue length and virtual waiting time processes arising in this model. These approximations, which are generated by numerically integrating only 7 ordinary di erential equations, are justi ed by limit theorems where the arrival rate and number of servers grow large. We compare our approximations to simulations, and they perform extremely well.
منابع مشابه
Waiting Time Asymptotics for Time Varying Multiserver Queues with Abandonment and Retrials
We consider a nonstationary Markov multiserver queueing model where waiting customers may abandon and subsequently retry. In this paper we derive uid and di usion approximations for the associated waiting time process. The uid and di usion approximations for the corresponding queue length process were obtained in [4] (see also [5]).
متن کاملThe Probability of Large Queue Lengths and Waiting times in a Heterogeneous Multiserver Queue Part I: Tight Limits
We consider a multiserver queuing process speciied by i.i.d. interarrival time, batch size and service time sequences. In the case that diierent servers have diierent service time distributions we say the system is heterogeneous. In this paper we establish conditions for the queuing process to be characterized as a geometrically Harris recurrent Markov chain, and we characterize the stationary ...
متن کاملHeavy-traffic Limits for Waiting times in Many-server Queues with Abandonment
We establish heavy-traffic stochastic-process limits for waiting times in many-server queues with customer abandonment. If the system is asymptotically critically loaded, as in the quality-and-efficiencydriven (QED) regime, then a bounding argument shows that the abandonment does not affect waiting-time processes. If instead the system is overloaded, as in the efficiency-driven (ED) regime, fol...
متن کاملCritically Loaded Time-Varying Multiserver Queues: Computational Challenges and Approximations
In this paper, we consider time-varying multi-server queues with abandonment and retrials. For their performance analysis, fluid and diffusion limits utilizing strong approximations have been widely used in the literature. Although those limits are asymptotically exact, they may not accurately approximate performance of multi-server queues even if the number of servers is large. To address that...
متن کاملAsymptotic Inference for Waiting Times and Patiences in Queues with Abandonment
Motivated by applications in call center management, we propose a framework based on empirical process techniques for inference about the waiting time and patience distribution in multiserver queues with abandonment. The framework rigorises heuristics based on survival analysis of independent and identically distributed observations by allowing correlated successive waiting times. Assuming a re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Telecommunication Systems
دوره 21 شماره
صفحات -
تاریخ انتشار 2002